Rational exponents in extremal graph theory
نویسندگان
چکیده
Given a family of graphs H, the extremal number ex(n,H) is the largest m for which there exists a graph with n vertices and m edges containing no graph from the family H as a subgraph. We show that for every rational number r between 1 and 2, there is a family of graphs Hr such that ex(n,Hr) = Θ(n r). This solves a longstanding problem in the area of extremal graph theory.
منابع مشابه
Rational Fibrations of M5,1 and M6,1
We construct rational maps from M5,1 and M6,1 to lower-dimensional moduli spaces. As a consequence, we identify geometric divisors that generate extremal rays of the effective cones for these spaces.
متن کاملExtremal Lyapunov Exponents: an Invariance Principle and Applications
We propose a new approach to analyzing dynamical systems that combine hyperbolic and non-hyperbolic (“center”) behavior, e.g. partially hyperbolic diffeomorphisms. A number of applications illustrate its power. We find that any ergodic automorphism of the 4-torus with two eigenvalues in the unit circle is stably Bernoulli among symplectic maps. Indeed, any nearby symplectic map has no zero Lyap...
متن کاملLiouville Type Results and Regularity of the Extremal Solutions of Biharmonic Equation with Negative Exponents
We first obtain Liouville type results for stable entire solutions of the biharmonic equation −∆2u = u−p in R for p > 1 and 3 ≤ N ≤ 12. Then we consider the Navier boundary value problem for the corresponding equation and improve the known results on the regularity of the extremal solution for 3 ≤ N ≤ 12. As a consequence, in the case of p = 2, we show that the extremal solution u∗ is regular w...
متن کاملThe E 8 - lattice , the Leech lattice and beyond
In this elementary talk, we introduce basics about rational lattices and give examples. Some lattices are really good ones, notably the E8-lattice in dimension 8 and the Leech lattice in dimension 24. Both have remarkable finite isometry groups and give sphere packings of remarkably high minimum norms and high packing densities. Generalizations to higher dimensions have been considered, for exa...
متن کاملScaling in Tournaments
We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q ≤ 1/2, and the stronger player wins with probability 1−q. The loser is eliminated. Extremal statistics of the initial distribution of player strengths governs the tournament outcome. For a uniform initial distributi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015